Recoverability in quantum information theory
نویسندگان
چکیده
منابع مشابه
Recoverability in quantum information theory
The fact that the quantum relative entropy is non-increasing with respect to quantum physical evolutions lies at the core of many optimality theorems in quantum information theory and has applications in other areas of physics. In this work, we establish improvements of this entropy inequality in the form of physically meaningful remainder terms. One of the main results can be summarized inform...
متن کاملMultipartite quantum correlations and local recoverability.
Characterizing genuine multipartite quantum correlations in quantum physical systems has historically been a challenging problem in quantum information theory. More recently, however, the total correlation or multipartite information measure has been helpful in accomplishing this goal, especially with the multipartite symmetric quantum (MSQ) discord (Piani et al. 2008 Phys. Rev. Lett. 100, 0905...
متن کاملMonotonicity of quantum relative entropy and recoverability
The relative entropy is a principal measure of distinguishability in quantum information theory, with its most important property being that it is non-increasing under noisy quantum operations. Here, we establish a remainder term for this inequality that quantifies how well one can recover from a loss of information by employing a rotated Petz recovery map. The main approach for proving this re...
متن کاملQuantum Correlations in Information Theory
The project concerned the study of quantum correlations (QC) in compound systems, i.e. statistical correlations more general than entanglement which are predicted by quantum mechanics but not described in any classical scenario. I aimed to understand the technical and operational properties of the measures of QC, their interplay with entanglement quantifiers and the experimental accessibility. ...
متن کاملTopics in Quantum Information Theory
Bit strings are the simplest possible way of encoding information, which is why it is the most common representation of information in information theory. The Hamming space of dimension n is the space of bit strings of length n, denoted as {0, 1}n. It is a discrete space with 2 points, which can be mapped to the vertices of an n-dimensional hypercube. By moving along an edge of this hypercube w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2015
ISSN: 1364-5021,1471-2946
DOI: 10.1098/rspa.2015.0338